A Limit Theorem for the Shannon Capacities of Odd Cycles I
نویسنده
چکیده
This paper contains a construction for independent sets in the powers of odd cycles. It follows from this construction that the limit as n goes to infinity of n+ 1/2−Θ(C2n+1) is zero, where Θ(G) is the Shannon capacity of the graph G.
منابع مشابه
A Limit Theorem for the Shannon Capacities of Odd Cycles. Ii
It follows from a construction for independent sets in the powers of odd cycles given in the predecessor of this paper that the limit as k goes to infinity of k+ 1/2−Θ(C2k+1) is zero, where Θ(G) is the Shannon capacity of a graph G. This paper contains a shorter proof of this limit theorem that is based on an ‘expansion process’ introduced in an older paper of L. Baumert, R. McEliece, E. Rodemi...
متن کاملSome remarks on the Shannon capacity of odd cycles
We tackle the problem of estimating the Shannon capacity of cycles of odd length. We present some strategies which allow us to nd tight bounds on the Shannon capacity of cycles of various odd lengths, and suggest that the diiculty of obtaining a general result may be related to diierent behaviours of the capacity, depending on the \structure" of the odd integer representing the cycle length. We...
متن کاملA nontrivial lower bound on the Shannon capacities of the complements of odd cycles
This paper contains a construction for independent sets in the powers of the complements of odd cycles. In particular, we show that α ( C 2 2n+3 ) ≥ 22n + 1. It follows that for n ≥ 0 we have Θ(C2n+3) > 2, where Θ(G) denotes the Shannon capacity of graph G.
متن کاملRelationships between Darboux Integrability and Limit Cycles for a Class of Able Equations
We consider the class of polynomial differential equation x&= , 2(,)(,)(,)nnmnmPxyPxyPxy++++2(,)(,)(,)nnmnmyQxyQxyQxy++&=++. For where and are homogeneous polynomials of degree i. Inside this class of polynomial differential equation we consider a subclass of Darboux integrable systems. Moreover, under additional conditions we proved such Darboux integrable systems can have at most 1 limit cycle.
متن کاملNew lower bounds for the Shannon capacity of odd cycles
The Shannon capacity of a graphG is defined as c(G) = supd≥1(α(G )) 1 d , where α(G) is the independence number of G. The Shannon capacity of the cycle C5 on 5 vertices was determined by Lovász in 1979, but the Shannon capacity of a cycle Cp for general odd p remains one of the most notorious open problems in information theory. By prescribing stabilizers for the independent sets in C p and usi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003